A modified extragradient algorithm for a certain class of split pseudo-monotone variational inequality problem

نویسندگان

چکیده

<p style='text-indent:20px;'>In this paper, we introduce and study a modified extragradient algorithm for approximating solutions of certain class split pseudo-monotone variational inequality problem in real Hilbert spaces. Using our proposed algorithm, established strong convergent result the aforementioned problem. Our is obtained without prior knowledge Lipschitz constant operator used with minimized number projections per iteration compared to other results on literature. Furthermore, numerical examples are given show performance advantage method as well comparing it related methods literature.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

متن کامل

A modified subgradient extragradient method for solving monotone variational inequalities

In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function. Our iterative process is relaxed and self-adaptive, that is, in each iteration, calculating two metric projections onto some half-spaces containing the domain is involved only and the step siz...

متن کامل

The Split Variational Inequality Problem

We propose a new variational problem which we call the Split Variational Inequality Problem (SVIP). It entails …nding a solution of one Variational Inequality Problem (VIP), the image of which under a given bounded linear transformation is a solution of another VIP. We construct iterative algorithms that solve such problems, under reasonable conditions, in Hilbert space and then discuss special...

متن کامل

A general descent framework for the monotone variational inequality problem

We present a framework for descent algorithms that solve the monotone variational inequality problem V IP v which consists in nding a solution v 2 v which satisses s(v) T (u?v) 0, for all u 2 v. This uniied framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formula...

متن کامل

A New Version of Extragradient Method for Variational Inequality Problems

In this paper, we propose a new version of extragradient method for the variational inequality problem. The method uses a new searching direction which differs from any one in existing projection-type methods, and is of a better stepsize rule. Under a certain generalized monotonicity condition, it is proved to be globally convergent. @ 2001 Eisevier Science Ltd. All rights reserved. Keywords-Vs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Algebra, Control and Optimization

سال: 2022

ISSN: ['2155-3297', '2155-3289']

DOI: https://doi.org/10.3934/naco.2021011